Any monotone property of 3-uniform hypergraphs is weakly evasive
نویسندگان
چکیده
منابع مشابه
Any Monotone Property of 3-Uniform Hypergraphs Is Weakly Evasive
For a Boolean function f, let D(f) denote its deterministic decision tree complexity, i.e., minimum number of (adaptive) queries required in worst case in order to determine f. In a classic paper, Rivest and Vuillemin [19] show that any non-constant monotone property P : {0, 1}( n 2) → {0, 1} of n-vertex graphs has D(P) = Ω(n). We extend their result to 3-uniform hypergraphs. In particular, we ...
متن کاملOn a Turán Problem in Weakly Quasirandom 3-uniform Hypergraphs
Extremal problems for 3-uniform hypergraphs are known to be very difficult and despite considerable effort the progress has been slow. We suggest a more systematic study of extremal problems in the context of quasirandom hypergraphs. We say that a 3-uniform hypergraph H “ pV,Eq is weakly pd, ηq-quasirandom if for any subset U Ď V the number of hyperedges of H contained in U is in the interval d...
متن کاملEvery Monotone 3-Graph Property is Testable
Let k ≥ 2 be a fixed integer and P be a property of k-uniform hypergraphs. In other words, P is a (typically infinite) family of k-uniform hypergraphs and we say a given hypergraph H satisfies P if H ∈ P . For a given constant η > 0 a k-uniform hypergraph H on n vertices is η-far from P if no hypergraph obtained from H by changing (adding or deleting) at most ηn edges in H satisfies P . More pr...
متن کاملPartitioning 3-uniform hypergraphs
Bollobás and Thomason conjectured that the vertices of any r-uniform hypergraph with m edges can be partitioned into r sets so that each set meets at least rm/(2r − 1) edges. For r = 3, Bollobás, Reed and Thomason proved the lower bound (1− 1/e)m/3 ≈ 0.21m, which was improved to 5m/9 by Bollobás and Scott (while the conjectured bound is 3m/5). In this paper, we show that this Bollobás-Thomason ...
متن کاملMatchings in 3-uniform hypergraphs
We determine the minimum vertex degree that ensures a perfect matching in a 3-uniform hypergraph. More precisely, suppose thatH is a sufficiently large 3-uniform hypergraph whose order n is divisible by 3. If the minimum vertex degree of H is greater than ( n−1 2 )
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.11.012